A Natural Deduction System for First Degree Entailment
نویسندگان
چکیده
This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE, we develop a natural deduction system for FDE. We then prove soundness and completeness of the system with respect to the semantics. The system neatly represents the four-valued semantics for FDE.
منابع مشابه
EnCal: an automated forward deduction system for general-purpose entailment calculus
This paper presents the fundamental design ideas, working principles, and implementation of an automated forward deduction system for general-purpose entailment calculus, named EnCal, shows its potential applications in knowledge acquisition, reasoning rule generation, and theorem finding, reports some current results of our experiments with EnCal, and suggests some important research problems.
متن کاملParallel Forward Deduction Algorithms of General-Purpose Entailment Calculus on Shared-Memory Parallel Computers
An automated forward deduction system for entailment calculus is an indispensable component of many application systems – such as theorem finding, active database, knowledge discovery systems – that require an autonomous reasoning engine. The performance of an automated forward deduction system is crucial to its applicability. In this paper, we present some parallel forward deduction algorithms...
متن کاملDeduction Schemes for Association Rules
Several notions of redundancy exist for Association Rules. Often, these notions take the form “any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant”; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deductio...
متن کاملFirst Notes on Maximum Entropy Entailment for Quantified Implications
Entropy is a measure for the uninformativeness or randomness of a data set, i.e., the higher the entropy is, the lower is the amount of information. In the field of propositional logic it has proven to constitute a suitable measure to be maximized when dealing with models of probabilistic propositional theories. More specifically, it was shown that the model of a probabilistic propositional the...
متن کاملProceedings of the First International Workshop on Debugging Ontologies and Ontology Mappings - WoDOOM 12 Galway , Ireland
Debugging OWL ontologies can be aided with automated reasoners that generate entailments, including undesirable ones. This information is, however, only useful if developers understand why the entailments hold. To support domain experts (with limited knowledge of OWL), we are developing a system that explains, in English, why an entailment follows from an ontology. In planning such explanations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 40 شماره
صفحات -
تاریخ انتشار 1999